Iterative Rounding and Relaxation
نویسندگان
چکیده
In this survey paper we present an iterative method to analyze linear programming formulations for combinatorial optimization problems. This method is introduced by Jain to give a 2-approximation algorithm for the survivable network design problem. First we will present Jain’s method and the necessary background including the uncrossing technique in Section 2. Then we extend the iterative method by a new relaxation step to tackle degree-bounded network design problems, and obtain approximation algorithms with only additive constant errors on the degrees in Section 3. For the minimum bounded degree spanning tree problem, this gives a very simple approximation algorithm with error at most one on the degrees, proving a conjecture of Goemans in Section 4. This method can also be applied to directed graphs, and some recent results on the minimum bounded degree arborescence problem will be highlighted in Section 5. Finally, we discuss how this method provides new proofs of exact linear programming formulations for classical combinatorial optimization problems, and present some new results for the degree bounded matroid problem and the degree bounded submodular flow problem in Section 6.
منابع مشابه
A bad example for the iterative rounding method for mincost k-connected spanning subgraphs
Jain’s iterative rounding method and its variants give the best approximation guarantees known for many problems in the area of network design. The method has been applied to the mincost k-connected spanning subgraph problem, but the approximation guarantees given by the method are weak. We construct a family of examples such that the standard LP relaxation has an extreme point solution with in...
متن کاملCS 787 : Advanced Algorithms LP - Based Approximations
We present methods for constructing approximation algorithms to NP-hard optimization problems using linear programming (LP). We typically obtain an LP relaxation of the problem by formulating it as an integer linear program and dropping the integrality constraints. We then solve the LP relaxation exactly, and apply various rounding strategies (including randomized rounding and iterative roundin...
متن کاملModular Community Detection in Networks
Network community detection—the problem of dividing a network of interest into clusters for intelligent analysis—has recently attracted significant attention in diverse fields of research. To discover intrinsic community structure a quantitative measure called modularity has been widely adopted as an optimization objective. Unfortunately, modularity is inherently NP-hard to optimize and approxi...
متن کاملConstant Approximation for k-Median and k-Means with Outliers via Iterative Rounding
In this paper, we present a new iterative rounding framework for many clustering problems. Using this, we obtain an (α1 + ≤ 7.081 + )-approximation algorithm for k-median with outliers, greatly improving upon the large implicit constant approximation ratio of Chen [16]. For k-means with outliers, we give an (α2 + ≤ 53.002 + )-approximation, which is the first O(1)-approximation for this problem...
متن کاملRounding-based Moves for Semi-Metric Labeling
Semi-metric labeling is a special case of energy minimization for pairwise Markov random fields. The energy function consists of arbitrary unary potentials, and pairwise potentials that are proportional to a given semi-metric distance function over the label set. Popular methods for solving semi-metric labeling include (i) move-making algorithms, which iteratively solve a minimum st-cut problem...
متن کاملRounding-based Moves for Metric Labeling
Metric labeling is a special case of energy minimization for pairwise Markov random fields. The energy function consists of arbitrary unary potentials, and pairwise potentials that are proportional to a given metric distance function over the label set. Popular methods for solving metric labeling include (i) move-making algorithms, which iteratively solve a minimum st-cut problem; and (ii) the ...
متن کامل